Deterministic finite state automaton 決定型有限狀態(tài)機
Based on multiple patterns match algorithm - deterministic finite state automata ( dfsa ) , a dfa has been designed , which can identify multiple kind numbers 摘要基于有限自動機的多模式匹配算法( dfsa算法) ,設(shè)計出同時識別多種數(shù)的有限自動機。
( 2 ) based on dfsa algorithm ( deterministic finite state automaton ) and combined with quick search algorithm , this paper analyses and implements a new multi - pattern string match algorithm that consumes less half of memory space of standard dfsa algorithm 該算法是以確定性有限狀態(tài)自動機( dfsa )為基礎(chǔ),結(jié)合quicksearch算法而提出的,可以用來提高主題爬行器的網(wǎng)頁分析和web網(wǎng)頁分類器的速度。